全文获取类型
收费全文 | 71篇 |
免费 | 33篇 |
国内免费 | 3篇 |
出版年
2020年 | 2篇 |
2019年 | 1篇 |
2018年 | 2篇 |
2017年 | 3篇 |
2016年 | 10篇 |
2015年 | 7篇 |
2014年 | 9篇 |
2013年 | 5篇 |
2012年 | 4篇 |
2011年 | 9篇 |
2010年 | 8篇 |
2009年 | 6篇 |
2008年 | 6篇 |
2007年 | 4篇 |
2006年 | 2篇 |
2005年 | 2篇 |
2004年 | 5篇 |
2003年 | 1篇 |
2002年 | 3篇 |
2001年 | 3篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 4篇 |
1993年 | 3篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1988年 | 1篇 |
排序方式: 共有107条查询结果,搜索用时 234 毫秒
1.
The importance of subset selection in multiple regression has been recognized for more than 40 years and, not surprisingly, a variety of exact and heuristic procedures have been proposed for choosing subsets of variables. In the case of polynomial regression, the subset selection problem is complicated by two issues: (1) the substantial growth in the number of candidate predictors, and (2) the desire to obtain hierarchically well‐formulated subsets that facilitate proper interpretation of the regression parameter estimates. The first of these issues creates the need for heuristic methods that can provide solutions in reasonable computation time; whereas the second requires innovative neighborhood search approaches that accommodate the hierarchical constraints. We developed tabu search and variable neighborhood search heuristics for subset selection in polynomial regression. These heuristics are applied to a classic data set from the literature and, subsequently, evaluated in a simulation study using synthetic data sets. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
2.
一类高次多项式系统极限环的讨论 总被引:1,自引:0,他引:1
封汉颍 《军械工程学院学报》1997,(1)
通过变换将一类高次多项式系统化为Lienard系统,利用Hopf分枝定理和张芷芬唯一性定理,证明了该类系统极限环的存在性与唯一性。 相似文献
3.
本文是文献[1—3]的继续,主要研究火炮射表数据处理算法的计算步骤和程序设计框图。这两个内容是正确进行程序设计、分析和使用的重要环节。 相似文献
4.
Joseph Y.‐T. Leung 《海军后勤学研究》2002,49(4):422-431
We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020 相似文献
5.
张金槐 《国防科技大学学报》2001,23(6):109-113
研究了当试验次数较少时 ,命中圆域的概率估计。给出了自助估计法和融合估计方法 ,对于估计的精度进行了分析。方法易于实现 ,适用于工程应用 相似文献
6.
设计了倾角较小的GEO导航星的广播星历拟合算法。该方法的核心思想是在常规拟合算法的基础上对位置观测量进行合理的坐标系参考平面旋转,特别是提出针对拟合迭代初值进行相应的坐标变换,从而既可以解决轨道参数拟合的相关性问题,使轨道参数拟合快速收敛,同时又兼顾了用户接收机的计算简便化。通过仿真验证,该方法简洁有效,拟合中误差RMS在厘米量级,能够保证拟合精度。 相似文献
7.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献
8.
9.
10.
针对火炮身管上标记两个点检测调炮精度受制于单个空间点坐标测量精度的问题,提出通过增加身管上标记点的冗余数量来提高调炮精度的检测方法。应用最小二乘原理对多个空间点进行直线拟合,并采用Monte Carlo方法对身管指向的测量精度进行分析。结果表明:标记4个点、5个点、6个点和7个点与标记2个点(传统方法)相比,其身管指向的测量精度分别提高了约6%、18%、19%和21%。该方法适用于对调炮精度检测要求较高的场合,综合考虑工作效率和测量精度这两个因素,推荐标记5个点测量身管指向。 相似文献